package MapAndSet;

public class HashBuck {
    static  class  Node{
        public  int key;
        public  int val;
        public  Node next;

        public Node(int key, int val) {
            this.key = key;
            this.val = val;
        }

    }
    public Node[] array = new Node[10];
    public  int usedSize;
    public static final  double DEFAULT_LOAD_FACTOR = 0.75f;
    public  void put(int key,int val){
        int a = key%array.length;
        Node cur = array[a];
        while (cur!=null){
            if (cur.key==key){
                cur.val=val;
                return;
            }
            cur =cur.next;
        }
        //没有找到当前链表中有这个key的节点
        Node node = new Node(key,val);
       node.next =array[a];
       array[a] = node;
        usedSize++;
        if (doLoadFactor()>=DEFAULT_LOAD_FACTOR){
            resize();
        }
    }
    public  void resize(){
        Node[] newArray = new Node[2*array.length];
        for (int i = 0; i < array.length; i++) {
            Node cur =array[i];
            while (cur !=null){
                int newIndex =cur.key% newArray.length;
                Node curN = cur.next;
                cur.next = newArray[newIndex];
                newArray[newIndex] = cur;
                cur =curN;
            }
        }
    }
    public  double doLoadFactor(){
        return usedSize*1.0/array.length;
    }
    public  int getVal(int key){
        int index = key%array.length;
        Node cur = array[index];
        while (cur !=null){
            if (cur.key==key){
                return  cur.val;
            }
            cur = cur.next;
        }
        return 0;
    }
}
